Improving GAC-4 for Table and MDD Constraints
نویسندگان
چکیده
We introduce GAC-4R, MDD-4, and MDD-4R three new algorithms for maintaining arc consistency for table and MDD constraints. GAC-4R improves the well-known GAC-4 algorithm by managing the internal data structures in a different way. Instead of maintaining the internal data structures only by studying the consequences of deletions, we propose to reset the data structures by recomputing them from scratch whenever it saves time. This idea avoids the major drawback of the GAC-4 algorithm, i.e., its cost at a shallow searchtree depth. We also show that this idea can be exploited in MDD constraints. Experiments show that GAC-4R is competitive with the best arc-consistency algorithms for table constraints, and that MDD-4R clearly outperforms all classical algorithms for table or MDD constraints.
منابع مشابه
Maintaining Generalized Arc Consistency on Ad Hoc r-Ary Constraints
In many real-life problems, constraints are explicitly defined as a set of solutions. This ad hoc (table) representation uses exponential memory and makes support checking (for enforcing GAC) difficult. In this paper, we address both problems simultaneously by representing an ad hoc constraint with a multi-valued decision diagram (MDD), a memory efficient data structure that supports fast suppo...
متن کاملMaking Simple Tabular ReductionWorks on Negative Table Constraints
Simple Tabular Reduction algorithms (STR) work well to establish Generalized Arc Consistency (GAC) on positive table constraints. However, the existing STR algorithms are useless for negative table constraints. In this work, we propose a novel STR algorithm and its improvement, which work on negative table constraints. Our preliminary experiments are performed on some random instances and a cer...
متن کاملAn Efficient Higher-Order Consistency Algorithm for Table Constraints
Table constraints are very important in constraint programming as they are present in many real problems from areas such as configuration and databases. As a result, numerous specialized algorithms that achieve generalized arc consistency (GAC) on table constraints have been proposed. Since these algorithms achieve GAC, they operate on one constraint at a time. In this paper we propose an effic...
متن کاملImproving the Expressiveness of Table Constraints
The time complexity of algorithms establishing arc consistency for table constraints depends mainly on the number of involved tuples. Thus, several work have been carried out in order to decrease that number. Notably, Katsirelos and Walsh have proposed to compress the tuple set. They integrate their method into GAC-Schema and they showed how a set of f forbidden tuples may be represented by a s...
متن کاملGAC on Conjunctions of Constraints
Applying GAC on conjunctions of constraints can lead to more powerful pruning [1]. We show that there exists a simple heuristic for deciding which constraints might be useful to conjoin. The result is a useful automatic way of improving a CSP model for GAC solving.
متن کامل